Diversity of uniform intersecting families
نویسنده
چکیده
A family F ⊂ 2[n] is called intersecting, if any two of its sets intersect. Given an intersecting family, its diversity is the number of sets not passing through the most popular element of the ground set. Frankl made the following conjecture: for n > 3k > 0 any intersecting family F ⊂ ([n] k ) has diversity at most ( n−3 k−2 ) . This is tight for the following “two out of three” family: {F ∈ ([n] k ) : |F ∩ [3]| ≥ 2}. In this note we prove this conjecture for n ≥ ck, where c is a constant independent of n and k.
منابع مشابه
Intersecting Families — Uniform versus Weighted
What is the maximal size of k-uniform r-wise t-intersecting families? We show that this problem is essentially equivalent to determine the maximal weight of non-uniform r-wise t-intersecting families. Some EKR type examples and their applications are included.
متن کاملMost Probably Intersecting Hypergraphs
The celebrated Erdős-Ko-Rado theorem shows that for n > 2k the largest intersecting k-uniform set family on [n] has size ( n−1 k−1 ) . It is natural to ask how far from intersecting larger set families must be. Katona, Katona and Katona introduced the notion of most probably intersecting families, which maximise the probability of random subfamilies being intersecting. We consider the most prob...
متن کاملCovers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász
We discuss the maximum size of uniform intersecting families with covering number at least . Among others, we construct a large k-uniform intersecting family with covering number k, which provides a counterexample to a conjecture of Lov asz. The construction for odd k can be visualized on an annulus, while for even k on a Mobius band.
متن کاملUniform Intersecting Families with Covering Number Restrictions
It is known that any k-uniform family with covering number t has at most k t t-covers. In this paper, we give better upper bounds for the number of t-covers in k-uniform intersecting families with covering number t.
متن کاملHow Different Can Two Intersecting Families Be?
To measure the difference between two intersecting families F ,G ⊆ 2[n] we introduce the quantity D(F ,G) = |{(F,G) : F ∈ F , G ∈ G, F ∩ G = ∅}|. We prove that if F is k-uniform and G is l-uniform, then for large enough n and for any i 6= j Fi = {F ⊆ [n] : i ∈ F, |F | = k} and Fj = {F ⊆ [n] : j ∈ F, |F | = l} form an optimal pair of families (that is D(F ,G) ≤ D(Fi,Fj) for all uniform and inter...
متن کامل